A Generalised-Mutual-Information-Based Oracle for Hierarchical Radiosity

نویسندگان

  • Jaume Rigau
  • Miquel Feixas
  • Mateu Sbert
چکیده

One of the main problems in the radiosity method is how to discretise a scene into mesh elements that allow us to accurately represent illumination. In this paper we present a new refinement criterion for hierarchical radiosity based on the continuous and discrete generalised mutual information measures between two patches or elements. These measures, derived from the generalised entropy of Harvda-Charvát-Tsallis, express the information transfer within a scene. The results obtained improve on the ones based on kernel smoothness and Shannon mutual information.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Information - Theoretic Refinement Criteria for Image Synthesis

This work is framed within the context of computer graphics starting out from the intersection of three fields: rendering , information theory , and complexity . Initially, the concept of scene complexity is analysed considering three perspectives from a geometric visibility point of view: complexity at an interior point , complexity of an animation, and complexity of a region. The main focus o...

متن کامل

A Graph Based Process for Easy Design of Refinement Oracle in Hierarchical Radiosity

Refinement is the part of the hierarchical radiosity algorithm that decides the best subdivision of the scene geometry to meet user goals using minimum resources. The refinement oracle is a central component of the radiosity algorithm, because it affects the computation time and the radiosity computation error. Hierarchical radiosity refinement remains a research topic today because of the vari...

متن کامل

Applications of Information Theory to Computer Graphics

We present in this talk several applications of Information Theory to Computer Graphics, based on the use of the measures of entropy and mutual information, f-divergences and generalized entropies. Application areas presented are hierarchical radiosity, adaptive pixel supersampling, selection of best view-points, object and scene exploration, mesh saliency, mesh simplification and object recogn...

متن کامل

A novel approach makes higher order wavelets really efficient for radiosity

Since wavelets were introduced in the radiosity algorithm5, surprisingly little research has been devoted to higher order wavelets and their use in radiosity algorithms. A previous study13 has shown that wavelet radiosity, and especially higher order wavelet radiosity was not bringing significant improvements over hierarchical radiosity and was having a very important extra memory cost, thus pr...

متن کامل

Importance-Driven Hierarchical Stochastic Ray Radiosity

In this paper we present a hierarchical Monte-Carlo radiosity algorithm driven by the view importance. The algorithm makes to possible to concentrate the computational effort on solution in the immediate environment of the observer, trading the low solution quality in invisible areas for better quality in areas that are visible for the observer. This is achieved by modifying the sampling probab...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007